LM-Cut: Optimal Planning with the Landmark-Cut Heuristic∗
نویسندگان
چکیده
The LM-Cut planner uses the landmark-cut heuristic, introduced by the authors in 2009, within a standard A∗ progression search framework to find optimal sequential plans for STRIPS-style planning tasks. This short paper recapitulates the main ideas surrounding the landmark-cut heuristic and provides pointers for further reading.
منابع مشابه
Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context Splitting
The LM-Cut heuristic is currently the most successful heuristic in optimal STRIPS planning but it cannot be applied in the presence of conditional effects. Keyder, Hoffmann and Haslum recently showed that the obvious extensions to such effects ruin the nice theoretical properties of LM-Cut. We propose a new method based on context splitting that preserves these properties.
متن کاملOptimal Planning for Delete-Free Tasks with Incremental LM-Cut
Optimal plans of delete-free planning tasks are interesting both in domains that have no delete effects and as the relaxation heuristic h in general planning. Many heuristics for optimal and satisficing planning approximate the h heuristic, which is well-informed and admissible but intractable to compute. In this work, branch-and-bound and IDA∗ search are used in a search space tailored to dele...
متن کاملIncremental LM-Cut
In heuristic search and especially in optimal classical planning the computation of accurate heuristic values can take up the majority of runtime. In many cases, the heuristic computations for a search node and its successors are very similar, leading to significant duplication of effort. For example most landmarks of a node that are computed by the LM-cut algorithm are also landmarks for the n...
متن کاملStrengthening Landmark Heuristics via Hitting Sets
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h. Equipped with this heuristic, a best-first search was able to optimally solve 40% more benchmark problems than the winners of the sequential optimization track of IPC 2008. We show that this heuristic can be understood as a simple relaxation of a hitting set ...
متن کاملMAXSAT Heuristics for Cost Optimal Planning
The cost of an optimal delete relaxed plan, known as h, is a powerful admissible heuristic but is in general intractable to compute. In this paper we examine the problem of computing h by encoding it as a MAXSAT problem. We develop a new encoding that utilizes constraint generation to supports the computation of a sequence of increasing lower bounds on h. We show a close connection between the ...
متن کامل